A Multi-Machine Scheduling Problem with Global Non Idling Constraint

A Multi-Machine Scheduling Problem with Global Non Idling Constraint

We deal here with a multi-machine scheduling problem with non idling constraints, i.e constraints which forbids the interruption of the use of the processors. We reformulate the problem, while using specific pyramidal profile functions, next get a min-max feasibility criterion and finally derive exact polynomial algorithms for both the feasibility problem and the makespan optimization problem.

The Hogeneous Non Idling Scheduling Problem

A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)

.

Study of Scheduling Problems with Machine Availability Constraint

In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...

A multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented ε-constraint method: A case study

The efficient management of nursing personnel is of vital importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. In the nurse scheduling problem (NSP), the target is to allocate shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. This paper presents a multi-objective...